翻訳と辞書
Words near each other
・ "O" Is for Outlaw
・ "O"-Jung.Ban.Hap.
・ "Ode-to-Napoleon" hexachord
・ "Oh Yeah!" Live
・ "Our Contemporary" regional art exhibition (Leningrad, 1975)
・ "P" Is for Peril
・ "Pimpernel" Smith
・ "Polish death camp" controversy
・ "Pro knigi" ("About books")
・ "Prosopa" Greek Television Awards
・ "Pussy Cats" Starring the Walkmen
・ "Q" Is for Quarry
・ "R" Is for Ricochet
・ "R" The King (2016 film)
・ "Rags" Ragland
・ ! (album)
・ ! (disambiguation)
・ !!
・ !!!
・ !!! (album)
・ !!Destroy-Oh-Boy!!
・ !Action Pact!
・ !Arriba! La Pachanga
・ !Hero
・ !Hero (album)
・ !Kung language
・ !Oka Tokat
・ !PAUS3
・ !T.O.O.H.!
・ !Women Art Revolution


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

cancellative semigroup : ウィキペディア英語版
cancellative semigroup
In mathematics, a cancellative semigroup (also called a cancellation semigroup) is a semigroup having the cancellation property. In intuitive terms, the cancellation property asserts that from an equality of the form ''a'' · ''b'' = ''a'' · ''c'', where · is a binary operation, one can cancel the element ''a'' and deduce the equality ''b'' = ''c''. In this case the element being canceled out is appearing as the left factors of ''a'' · ''b'' and ''a'' · ''c'' and hence it is a case of left cancellation property. The right cancellation property can be defined in an analogous way. Prototypical examples of cancellative semigroups are the groups and the semigroup of positive integers under addition or multiplication. Cancellative semigroups are considered to be very close to being groups because cancellability is one of the necessary conditions for a semigroup to be embeddable in a group. Moreover, every finite cancellative semigroup is a group. One of the main problems associated with the study of cancellative semigroups is to determine the necessary and sufficient conditions for embedding a cancellative semigroup in a group.
The origins of the study of cancellative semigroups can be traced to the first substantial paper on semigroups, .
==Formal definitions==

Let ''S'' be a semigroup. An element ''a'' in ''S'' is left cancellative (or, is 'left cancellable', or, has the 'left cancellation property') if ''ab'' = ''ac'' implies ''b'' = ''c'' for all ''b'' and ''c'' in ''S''. If every element in ''S'' is left cancellative, then ''S'' is called a left cancellative semigroup.
Let ''S'' be a semigroup. An element ''a'' in ''S'' is right cancellative (or, is 'right cancellable', or, has the 'right cancellation property') if ''ba'' = ''ca'' implies ''b'' = ''c'' for all ''b'' and ''c'' in ''S''. If every element in ''S'' is right cancellative, then ''S'' is called a right cancellative semigroup.
Let ''S'' be a semigroup. If every element in ''S'' is both left cancellative and right cancellative, then ''S'' is called a cancellative semigroup.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「cancellative semigroup」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.